Deterministic Distributed Vertex Coloring in Polylogarithmic Time
نویسندگان
چکیده
منابع مشابه
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n) edge 3spanner for it in O(log n) time. This algorithm is then extended into a deterministic algorithm for computing an O(k n) edge O(k)-spanner in 2 logk−1 n time for every integer parameter k 1. This establishes that the problem of the deterministic construction of a linear (in k) ...
متن کاملDeterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of the graph. In the distributed edge-coloring problem the processors are required to assign colors to edges, such that all edges incident on the same vertex are assigned distinct colors. The previouslykno...
متن کاملDeterministic Distributed Edge-Coloring with Fewer Colors
We present a deterministic distributed algorithm, in the LOCALmodel, that computes a (1+o(1))∆edge-coloring in polylogarithmic-time, so long as the maximum degree ∆ = Ω̃(logn). For smaller ∆, we give a polylogarithmic-time 3∆/2-edge-coloring. These are the first deterministic algorithms to go below the natural barrier of 2∆− 1 colors, and they improve significantly on the recent polylogarithmict...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملPolylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2011
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2027216.2027221